Sparse Recovery With Orthogonal Matching Pursuit Under RIP

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonal Matching Pursuit for Sparse Signal Recovery

We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional sparse signal based on a small number of noisy linear measurements. OMP is an iterative greedy algorithm that selects at each step the column which is most correlated with the current residuals. In this paper, we present a fully data driven OMP algorithm with explicit stopping rules. It is shown t...

متن کامل

The performance of orthogonal multi-matching pursuit under RIP

The orthogonal multi-matching pursuit (OMMP) is a natural extension of orthogonal matching pursuit (OMP). We denote the OMMP with the parameter M as OMMP(M) where M ≥ 1 is an integer. The main difference between OMP and OMMP(M) is that OMMP(M) selects M atoms per iteration, while OMP only adds one atom to the optimal atom set. In this paper, we study the performance of orthogonal multi-matching...

متن کامل

Improved RIP Analysis of Orthogonal Matching Pursuit

Orthogonal Matching Pursuit (OMP) has long been considered a powerful heuristic for attacking compressive sensing problems; however, its theoretical development is, unfortunately, somewhat lacking. This paper presents an improved Restricted Isometry Property (RIP) based performance guarantee for -sparse signal reconstruction that asymptotically approaches the conjectured lower bound given in Da...

متن کامل

Improved Bounds on RIP for Generalized Orthogonal Matching Pursuit

Generalized Orthogonal Matching Pursuit (gOMP) is a natural extension of OMP algorithm where unlike OMP, it may select N(≥ 1) atoms in each iteration. In this paper, we demonstrate that gOMP can successfully reconstruct a K-sparse signal from a compressed measurement y = Φx by K iteration if the sensing matrix Φ satisfies restricted isometry property (RIP) of order NK where δNK < √ N √ K+2 √ N ...

متن کامل

Sparse Subspace Clustering by Orthogonal Matching Pursuit

Subspace clustering methods based on `1, `2 or nuclear norm regularization have become very popular due to their simplicity, theoretical guarantees and empirical success. However, the choice of the regularizer can greatly impact both theory and practice. For instance, `1 regularization is guaranteed to give a subspace-preserving affinity (i.e., there are no connections between points from diffe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2011

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2011.2162263